Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
281	Structural Recursion over Contextual Objects Brigitte Pientka and Sherry Shanshan Ruan Andreas Abel School of Computer Science Add to Reading List Source URL: www2.tcs.ifi.lmu.de Language: English - Date: 2014-01-20 17:12:51 Functions and mappings Model theory Formal languages Metalogic Computability theory Symbol Interpretation Primitive recursive function Substitution Logic Mathematics Mathematical logic
282	On the Theory of Average Case Complexity Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:22 Complexity classes Computability theory Mathematical optimization Structural complexity theory P versus NP problem NP-complete Turing reduction Decision problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
283	Algorithms Lecture 3: Backtracking [Fa’14] ’Tis a lesson you should heed, Try, try again; Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:21 Search algorithms Computability theory Theory of computation Programming idioms Backtracking Recursion Eight queens puzzle Tree traversal Longest increasing subsequence Mathematics Applied mathematics Theoretical computer science
284	Chapter 1 Rewriting Nachum Dershowitz David A. Plaisted Add to Reading List Source URL: rewriting.loria.fr Language: English - Date: 2001-02-15 10:07:19 Applied mathematics Logic in computer science Mathematical logic Rewriting Computability theory Semi-Thue system Differential equation Normal form Linear equation Theoretical computer science Mathematics Formal languages
285	Logic and the Methodology of Science Autumn 2002 Preliminary Exam Draft August 23, Let ϕe be the eth partial recursive function in some standard enumeration, and let We be the domain of ϕe ). Show that there is Add to Reading List Source URL: logic.berkeley.edu Language: English - Date: 2014-08-24 16:43:20 Theory of computation Theoretical computer science Metalogic Model theory Recursively enumerable set Constructible universe Presentation of a group Ordinal number Ω-consistent theory Mathematics Mathematical logic Computability theory
286	Under consideration for publication in J. Functional Programming 1 The Arrow Calculus Sam Lindley, Philip Wadler, and Jeremy Yallop Add to Reading List Source URL: groups.inf.ed.ac.uk Language: English - Date: 2009-10-19 06:42:21 Lambda calculus Computability theory Fixed-point combinator Arrow Quiver Natural deduction Combinatory logic Theoretical computer science Mathematics Applied mathematics
287	4. Computability on the Real Numbers Real numbers are the basic objects in analysis. For most non-mathematicians a real number is an infinite decimal fraction, for example π = 3•Mathematicians prefer to Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2009-09-05 02:33:58 Symbol Computable number Group representation Automata theory Representation theory of finite groups Ω-automaton Abstract algebra Mathematics Representation theory
288	Church’s undecidability result Alan Turing Birth Centennial Talk at IIT Bombay, Mumbai Joachim Breitner April 21, 2011 Add to Reading List Source URL: www.joachim-breitner.de Language: English - Date: 2014-10-06 15:51:37 Computability theory Theory of computation Lambda calculus Mathematical logic Church–Turing thesis Entscheidungsproblem Halting problem System F Computability Mathematics Theoretical computer science Computer science
289	Introduction to Computing: Explorations in Language, Logic, and Machines Add to Reading List Source URL: www.computingbook.org Language: English - Date: 2011-08-19 11:52:17 Computer science Turing machine Theory of computation Theoretical computer science Models of computation Busy beaver Computability Turing Recursive transition network Software engineering Computing Computability theory
290	Math 260ABC Introduction to Mathematical Logic Fall 1988-Sprint 1989 Instructor: Sam Buss Department of Mathematics University of California, San Diego Add to Reading List Source URL: euclid.ucsd.edu Language: English - Date: 2009-01-29 21:32:37 Computer science Turing machine Models of computation Alan Turing Computable function Computability Busy beaver Universal Turing machine Computability theory Theoretical computer science Theory of computation

UPDATE